(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0) → s(x)
gcd(0, s(y)) → s(y)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
min, max, -, gcd

They will be analysed ascendingly in the following order:
min < gcd
max < gcd
- < gcd

(6) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
min, max, -, gcd

They will be analysed ascendingly in the following order:
min < gcd
max < gcd
- < gcd

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

Induction Base:
min(gen_0':s2_0(0), gen_0':s2_0(0)) →RΩ(1)
0'

Induction Step:
min(gen_0':s2_0(+(n4_0, 1)), gen_0':s2_0(+(n4_0, 1))) →RΩ(1)
s(min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0))) →IH
s(gen_0':s2_0(c5_0))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
max, -, gcd

They will be analysed ascendingly in the following order:
max < gcd
- < gcd

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)

Induction Base:
max(gen_0':s2_0(0), gen_0':s2_0(0)) →RΩ(1)
gen_0':s2_0(0)

Induction Step:
max(gen_0':s2_0(+(n389_0, 1)), gen_0':s2_0(+(n389_0, 1))) →RΩ(1)
s(max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0))) →IH
s(gen_0':s2_0(c390_0))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
-, gcd

They will be analysed ascendingly in the following order:
- < gcd

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
-(gen_0':s2_0(n876_0), gen_0':s2_0(n876_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n8760)

Induction Base:
-(gen_0':s2_0(0), gen_0':s2_0(0)) →RΩ(1)
gen_0':s2_0(0)

Induction Step:
-(gen_0':s2_0(+(n876_0, 1)), gen_0':s2_0(+(n876_0, 1))) →RΩ(1)
-(gen_0':s2_0(n876_0), gen_0':s2_0(n876_0)) →IH
gen_0':s2_0(0)

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)
-(gen_0':s2_0(n876_0), gen_0':s2_0(n876_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n8760)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
gcd

(16) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol gcd.

(17) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)
-(gen_0':s2_0(n876_0), gen_0':s2_0(n876_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n8760)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

(19) BOUNDS(n^1, INF)

(20) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)
-(gen_0':s2_0(n876_0), gen_0':s2_0(n876_0)) → gen_0':s2_0(0), rt ∈ Ω(1 + n8760)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

(22) BOUNDS(n^1, INF)

(23) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)
max(gen_0':s2_0(n389_0), gen_0':s2_0(n389_0)) → gen_0':s2_0(n389_0), rt ∈ Ω(1 + n3890)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(24) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

(25) BOUNDS(n^1, INF)

(26) Obligation:

Innermost TRS:
Rules:
min(x, 0') → 0'
min(0', y) → 0'
min(s(x), s(y)) → s(min(x, y))
max(x, 0') → x
max(0', y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0') → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), s(y)) → gcd(-(s(max(x, y)), s(min(x, y))), s(min(x, y)))
gcd(s(x), 0') → s(x)
gcd(0', s(y)) → s(y)

Types:
min :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
max :: 0':s → 0':s → 0':s
- :: 0':s → 0':s → 0':s
gcd :: 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(27) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
min(gen_0':s2_0(n4_0), gen_0':s2_0(n4_0)) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n40)

(28) BOUNDS(n^1, INF)